Decomposition of mutational context signatures using quadratic programming methods

نویسندگان

  • Mohamed Helmy
  • Miguel Vazquez
چکیده

Methods for inferring signatures of mutational contexts from large cancer sequencing data sets are invaluable for biological research, but impractical for clinical application where we require tools that decompose the context data for an individual into signatures. One such method has recently been published using an iterative linear modelling approach. A natural alternative places the problem within a quadratic programming framework and is presented here, where it is seen to offer advantages of speed and accuracy. This article is included in the gateway. RPackage Andy G. Lynch ( ) Corresponding author: [email protected] Competing interests: No competing interests were declared. Lynch AG. How to cite this article: Decomposition of mutational context signatures using quadratic programming methods [version 1; 2016, :1253 (doi: ) referees: 1 approved, 1 approved with reservations] F1000Research 5 10.12688/f1000research.8918.1 © 2016 Lynch AG. This is an open access article distributed under the terms of the , which Copyright: Creative Commons Attribution Licence permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Data associated with the article are available under the terms of the (CC0 1.0 Public domain dedication). Creative Commons Zero "No rights reserved" data waiver AGL was supported in this work by a Cancer Research UK programme grant [C14303/A20406] to Simon Tavaré. AGL Grant information: acknowledges the support of the University of Cambridge, Cancer Research UK and Hutchison Whampoa Limited. Whole-genome sequencing of oesophageal adenocarcinoma was part of the oesophageal International Cancer Genome Consortium (ICGC) project. The oesophageal ICGC project was funded through a programme and infrastructure grant to Rebecca Fitzgerald as part of the OCCAMS collaboration. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript. 07 Jun 2016, :1253 (doi: ) First published: 5 10.12688/f1000research.8918.1 Referee Status:

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Detecting presence of mutational signatures in cancer with confidence

Motivation Cancers arise as the result of somatically acquired changes in the DNA of cancer cells. However, in addition to the mutations that confer a growth advantage, cancer genomes accumulate a large number of somatic mutations resulting from normal DNA damage and repair processes as well as carcinogenic exposures or cancer related aberrations of DNA maintenance machinery. These mutagenic pr...

متن کامل

SomaticSignatures: inferring mutational signatures from single-nucleotide variants

UNLABELLED Mutational signatures are patterns in the occurrence of somatic single-nucleotide variants that can reflect underlying mutational processes. The SomaticSignatures package provides flexible, interoperable and easy-to-use tools that identify such signatures in cancer sequencing data. It facilitates large-scale, cross-dataset estimation of mutational signatures, implements existing meth...

متن کامل

Genome analysis SomaticSignatures: inferring mutational signatures from single-nucleotide variants

Summary: Mutational signatures are patterns in the occurrence of somatic single-nucleotide variants that can reflect underlying mutational processes. The SomaticSignatures package provides flexible, interoperable and easy-to-use tools that identify such signatures in cancer sequencing data. It facilitates large-scale, cross-dataset estimation of mutational signatures, implements existing method...

متن کامل

Integration of Sequential Quadratic Programming and Domain Decomposition Methods for Nonlinear Optimal Control Problems

We discuss the integration of a sequential quadratic programming (SQP) method with an optimization-level domain decomposition (DD) preconditioner for the solution of the quadratic optimization subproblems. The DD method is an extension of the well-known Neumann-Neumann method to the optimization context and is based on a decomposition of the first order system of optimality conditions. The SQP ...

متن کامل

An iterative method for tri-level quadratic fractional programming problems using fuzzy goal programming approach

Tri-level optimization problems are optimization problems with three nested hierarchical structures, where in most cases conflicting objectives are set at each level of hierarchy. Such problems are common in management, engineering designs and in decision making situations in general, and are known to be strongly NP-hard. Existing solution methods lack universality in solving these types of pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017